package leetcode.problems;

import org.junit.Test;

/**
 * Created by gmwang on 2018/7/23
 * 珠宝和石头
 */
public class _0723JewelsandStones {
    /**
     * You're given strings J representing the types of stones that are jewels, and S representing the stones you have.  Each character in S is a type of stone you have.  You want to know how many of the stones you have are also jewels.
     *
     * The letters in J are guaranteed distinct, and all characters in J and S are letters. Letters are case sensitive, so "a" is considered a different type of stone from "A".
     *
     * 你会得到J代表珠宝类型的字符串，S代表你拥有的宝石。每个角色S都是你拥有的一种石头。你想知道你有多少宝石也是珠宝。
     *
     * 在这些信件J是保证不同，而在所有的字符J和S是字母。字母区分大小写，因此"a"被认为是不同类型的石头"A"。
     *
     * Example 1:
     *
     * Input: J = "aA", S = "aAAbbbb"
     * Output: 3
     *
     * Example 2:
     *
     * Input: J = "z", S = "ZZ"
     * Output: 0
     * Note:
     *
     * S and J will consist of letters and have length at most 50.
     * The characters in J are distinct.
     */
    public int numJewelsInStones(String J, String S) {
        int res = 0;
        for(int i=0;i<S.length();i++){
            if(J.contains(S.charAt(i)+"")) res ++;
        }
        return res;
    }
    @Test
    public void test(){
        String J = "aA";
        String S = "aAAbbbb";
        int res = numJewelsInStones(J, S);
        System.out.println(res);
    }
}
